Nearly Optimal Partial Steiner Systems
نویسنده
چکیده
A partial Steiner system Sp(t, k, n) is a collection of k-subsets (i.e. subsets of size k) of n element set such that every t-subset is contained in at most one k-subset. To avoid trivial cases, we assume 2 ≤ t < k < n. It is easy to see that the size of a partial Steiner system Sp(t, k, n) is at most ( n t )
منابع مشابه
More-Than-Nearly-Perfect Packings and Partial Designs
Results of Frankl and RR odl and of Pippenger and Spencer show that uniform hypergraphs which are almost regular and have small maximal pair degrees (codegrees) contain collections of pairwise disjoint edges (packings) which cover all but o(n) of the n vertices. Here we show, in particular, that regular uniform hypergraphs for which the ratio of degree to maximum codegree is n " , for some " > ...
متن کاملBounds on the achromatic number of partial triple systems
A complete k-colouring of a hypergraph is an assignment of k colours to the points such that (1) there is no monochromatic hyperedge, and (2) identifying any two colours produces a monochromatic hyperedge. The achromatic number of a hypergraph is the maximum k such that it admits a complete k-colouring. We determine the maximum possible achromatic number among all maximal partial triple systems...
متن کاملComplementary partial resolution squares for Steiner triple systems
In this paper, we introduce a generalization of frames called partial resolution squares. We are interested in constructing sets of complementary partial resolution squares for Steiner triple systems. Our main result is the existence of six complementary partial resolution squares for Steiner triple systems of order v which can be superimposed in a v × v array so that the resulting array is als...
متن کاملEmbedding Partial Steiner Triple Systems
We prove that a partial Steiner triple system 8 of order n can be embedded in a Steiner triple system T of any given admissible order greater than 4w. Furthermore, if G(S), the missing-edge graph of S, has the property that A(G)<ri(n + l)l and \E(G)\ then # can be embedded in a Steiner triple system of order 2n +1, provided that 2w +1 is admissible. We also prove that if there is a partial Stei...
متن کاملOptimal Doubly Constant Weight Codes
A doubly constant weight code is a binary code of length n1 + n2, with constant weight w1 + w2, such that the weight of a codeword in the first n1 coordinates is w1. Such codes have applications in obtaining bounds on the sizes of constant weight codes with givenminimum distance. Lower and upper bounds on the sizes of such codes are derived. In particular, we show tight connections between opti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 7 شماره
صفحات -
تاریخ انتشار 2001